Finding the k Shortest Paths in Parallel 1
نویسنده
چکیده
A concurrent-read exclusive-write PRAM algorithm is developed to find the k shortest paths between pairs of vertices in an edge-weighted directed graph. Repetitions of vertices along the paths are allowed. The algorithm computes an implicit representation of the k shortest paths to a given destination vertex from every vertex of a graph with n vertices and m edges, using O(m+nk log2 k)work and O(log3 k log∗ k+ log n(log log k+ log∗ n)) time, assuming that a shortest path tree rooted at the destination is pre-computed. The paths themselves can be extracted from the implicit representation in O(log k+log n) time, and O(n log n+L) work, where L is the total length of the output.
منابع مشابه
Finding the k Shortest Paths in
A concurrent-read exclusive-write PRAM algorithm is developed to nd the k shortest paths between pairs of vertices in an edge-weighted directed graph. Repetitions of vertices along the paths are allowed. The algorithm computes an implicit representation of the k shortest paths to a given destination vertex from every vertex of a graph with n vertices and m edges, using O(m + nk log 2 k) work an...
متن کاملReverse Shortest Path for Dataflow Optimization of Hierarchically Structure Data Networks
Abstract: In the routing process to select the data paths for Hierarchically Aggregation/Disaggregation and Composition/Decomposition,(HAD) networks, a fast algorithm for finding optimum paths for dataflow is needed. In this research we propose an algorithm called the Reverse Shortest Path algorithm to improve the speed in the calculating procedure for finding the shortest paths. This algorithm...
متن کاملFinding k Simple Shortest Paths and Cycles
We present algorithms and hardness results for several problems related to finding multiple simple shortest paths in a graph. Our main result is a new algorithm for finding k simple shortest paths for all pairs of vertices in a weighted directed graph G = (V,E). For k = 2 our algorithm runs in O(mn + n logn) time where m and n are the number of edges and vertices in G. Our approach is based on ...
متن کاملOn Node-to-Node Disjoint Paths in the Star Interconnection Network
We study the problem of finding disjoint paths between two nodes in a star interconnection network. Specifically, we show a simple routing algorithm that finds n − 1 disjoint paths between any two nodes s and t in an n-star in optimal O(n) time such that no path has length more than d(s, t) + 4, where d(s, t) is the shortest path length between s and t. This result matches those obtained earlie...
متن کاملFinding the k Shortest Paths
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest paths from a given source s to each vertex in the graph, in total time O(m+ n log n+ kn). We describe appli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000